Searching by heterogeneous agents

In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into classical edge problem considering edge-labeled graphs: once strategy initially assigns labels to searchers, each searcher can be only present on an of its own label. prove that not monotone even for trees give instances number recontamination events asymptotically quadratic tree size. Other negative results regard NP-completeness monotone, NP-hardness arbitrary (i.e., non-monotone) trees. These properties show behaves very differently from search. On other hand, if all edges particular label form (connected) subtree input tree, then optimal computed efficiently.